Syntactic Computation of Hybrid Possibilistic Conditioning under Uncertain Inputs
نویسندگان
چکیده
We extend hybrid possibilistic conditioning to deal with inputs consisting of a set of triplets composed of propositional formulas, the level at which the formulas should be accepted, and the way in which their models should be revised. We characterize such conditioning using elementary operations on possibility distributions. We then solve a difficult issue that concerns the syntactic computation of the revision of possibilistic knowledge bases, made of weighted formulas, using hybrid conditioning. An important result is that there is no extra computational cost in using hybrid possibilistic conditioning and in particular the size of the revised possibilistic base is polynomial with respect to the size of the initial base and the input.
منابع مشابه
On the Use of Min-Based Revision Under Uncertain Evidence for Possibilistic Classifiers
Possibilitic networks, which are compact representations of possibility distributions, are powerful tools for representing and reasoning with uncertain and incomplete knowledge. According to the operator conditioning is based on, there are two possibilistic settings: quantitative and qualitative. This paper deals with qualitative possibilistic network classifiers under uncertain inputs. More pr...
متن کاملBelief Revision with Uncertain Inputs in the Possibilistic Setting
This paper discusses belief revision under uncertain inputs in the framework of possibility theory. Revision can be based on two possible definitions of the conditioning operation, one based on min operator which requires a purely ordinal scale only , and another based on product, for which a richer structure is needed, and which is a particular case of Dempster's rule of conditioning . Besides...
متن کاملReasoning with Uncertain Inputs in Possibilistic Networks
Graphical belief models are compact and powerful tools for representing and reasoning under uncertainty. Possibilistic networks are graphical belief models based on possibility theory. In this paper, we address reasoning under uncertain inputs in both quantitative and qualitative possibilistic networks. More precisely, we first provide possibilistic counterparts of Pearl’s methods of virtual ev...
متن کاملCompatible-Based Conditioning in Interval-Based Possibilistic Logic
Interval-based possibilistic logic is a flexible setting extending standard possibilistic logic such that each logical expression is associated with a sub-interval of [0, 1]. This paper focuses on the fundamental issue of conditioning in the interval-based possibilistic setting. The first part of the paper first proposes a set of natural properties that an interval-based conditioning operator s...
متن کاملHybrid Possibilistic Conditioning for Revision under Weighted Inputs
We propose and investigate new operators in the possibilistic belief revision setting, obtained as different combinations of the conditioning operators on models and countermodels, as well as of how weighted inputs are interpreted. We obtain a family of eight operators that essentially obey the basic postulates of revision, with a few slight differences. These operators show an interesting vari...
متن کامل